Spherical Fibonacci Point Sets for Illumination Integrals
نویسندگان
چکیده
Quasi-Monte Carlo (QMC) methods exhibit a faster convergence rate than that of classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis, where it is frequently used for approximating the value of spherical integrals (e.g., illumination integral). The common approach for generating QMC sampling patterns for spherical integration is to resort to unit square low discrepancy sequences and map them to the hemisphere. However such an approach is suboptimal as these sequences do not account for the spherical topology and their discrepancy properties on the unit square are impaired by the spherical projection. In this article we present a strategy for producing high quality QMC sampling patterns for spherical integration by resorting to spherical Fibonacci point sets. We show that these patterns, when applied to illumination integrals, are very simple to generate and consistently outperform existing approaches, both in terms of Root Mean Square Error (RMSE) and image quality. Furthermore, only a single pattern is required to produce an image, thanks to a scrambling scheme performed directly in the spherical domain.
منابع مشابه
Thèse / Université De Rennes 1
The spherical sampling of the incident radiance function entails a high computational cost. Therefore the illumination integral must be evaluated using a limited set of samples. Such a restriction raises the question of how to obtain the most accurate approximation possible with such a limited set of samples. In this thesis, we show that existing Monte Carlo-based approaches can be improved by ...
متن کاملAnalysis of binning of normals for spherical harmonic cross-correlation
Spherical harmonic cross-correlation is a robust registration technique that uses the normals of two overlapping point clouds to bring them into coarse rotational alignment. This registration technique however has a high computational cost as spherical harmonics need to be calculated for every normal. By binning the normals, the computational efficiency is improved as the spherical harmonics ca...
متن کاملFibonacci sets and symmetrization in discrepancy theory
We study the Fibonacci sets from the point of view of their quality with respect to discrepancy and numerical integration. Let {bn}n=0 be the sequence of Fibonacci numbers. The bn-point Fibonacci set Fn ⊂ [0, 1] is defined as Fn := {(μ/bn, {μbn−1/bn})} μ=1, where {x} is the fractional part of a number x ∈ R. It is known that cubature formulas based on Fibonacci set Fn give optimal rate of error...
متن کاملIntegration and Approximation with Fibonacci lattice points
We study the properties of a special rank-1 point set in 2 dimensions — Fibonacci lattice points. We present the analysis of these point sets for cubature and approximation of bivariate periodic functions with decaying spectral coefficients. We are interested in truncating the frequency space into index sets based on different degrees of exactness. The numerical results support that the Lebesgu...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 32 شماره
صفحات -
تاریخ انتشار 2013